GROUP k-MUTUAL EXCLUSION FOR DISTRIBUTED SYSTEMS
نویسندگان
چکیده
In this paper, we propose an algorithm to solve the group k-mutual exclusion (Gk-ME) problem for distributed systems. The Gk-ME problem is concerned with controlling the concurrent accesses of some resource by at most k nodes with the constraint that no two distinct resources can be accessed simultaneously. The proposed algorithm utilizes a token circulation mechanism and does not require the nodes to have identifications. The delay and session switches of the proposed algorithm are Ω(n) and Ω(n), respectively.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملA New Extended Group Mutual Exclusion Algorithm with Low Message Complexity in Distributed Systems
The group mutual exclusion (GME) problem is an interesting generalization of the mutual exclusion problem. In the group mutual exclusion, multiple processes can enter a critical section simultaneously if they belong to the same group. In the extended group mutual exclusion, each process is a member of multiple groups at the same time. As a result, after the process by selecting a group enter cr...
متن کاملA Study on the Distributed k-Mutual Exclusion Problem
The distributed k-mutual exclusion problem is the problem of guaranteeing that at most k processes can enter a critical section at a time in a distributed system. The distributed 1-mutual exclusion problem is one of fundamental distributed problems in distributed systems and many algorithms for solving the problem have been proposed. In this paper, we introduce the k-coterie as an extension of ...
متن کاملA Quorum Based k-Mutual Exclusion by Weighted k-Quorum Systems
In this paper, we propose a scheme for solving the k-mutual exclusion problem in a distributed system, which is a generalization of the quorum based scheme for solving the distributed mutual exclusion problem. The proposed scheme uses a set of weighted quorums as the underlying structure, which can be constructed from any quorum system by applying the technique of k-decomposition. The notion of...
متن کاملA Study on Distributed k-Mutual Exclusion Algorithms
The mutual exclusion problem is a problem of arbitrating access conflicts for resources. The problem has been considered as a fundamental problem in computer science and extensively studied from the first minute operating systems started providing multi-tasking or multi-programming feature. Recently, a large number of computers are connected to a computer network. Such a system is called a dist...
متن کامل